Broadcast-Based Parallel Programming
نویسنده
چکیده
The properties of a parallel programming model are largely determined by the model of communication/interaction upon which it is based. Parallel programming models, languages and implementations have historically been formulated in terms of shared memory and/or message passing communication models. This paper motivates parallel programming models based on broadcast communication and defines and illustrates a parallel programming system based on associative broadcast. Associative broadcast is a dynamic multicast where the set of recipients for a message is dependent on the state of the processes in the broadcast network and is determined at runtime. Associative broadcast supports direct implementation of fully distributed (peer to peer) control. It enables dynamic composition of programs from components by integrating discovery, linking and invocation. A programming language and runtime system implementing the associative broadcast programming model are discussed including example programs and results. Parallel programs formulated in this programming model are intrinsically dynamically structured and faulttolerance via replication is readily obtained.
منابع مشابه
Functional Bulk Synchronous Parallel Programming in C++
This paper presents the BSFC++ library for functional bulk synchronous parallel programming in C++. It is based on an extension of the λ-calculus by parallel operations on a parallel data structure named parallel vector, which is given by intention. This guarantees the determinism and the absence of deadlock. Broadcast algorithms are implemented using the core library.
متن کاملPareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times
This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...
متن کاملTwo-stage fuzzy-stochastic programming for parallel machine scheduling problem with machine deterioration and operator learning effect
This paper deals with the determination of machine numbers and production schedules in manufacturing environments. In this line, a two-stage fuzzy stochastic programming model is discussed with fuzzy processing times where both deterioration and learning effects are evaluated simultaneously. The first stage focuses on the type and number of machines in order to minimize the total costs associat...
متن کاملA New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملFuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flow Time through Genetic Algorithm
Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters; this is why in recent decades extensive studies have been done on scheduling issues. One type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical model for...
متن کامل